Transitive decompositions of graph products: rank 3 grid type
نویسندگان
چکیده
A transitive decomposition is a pair ðG;PÞ where G is a graph and P is a partition of the arc set of G, such that there exists a group of automorphisms of G which leaves P invariant and transitively permutes the parts in P. This paper concerns transitive decompositions where the group is a primitive rank 3 group of ‘grid’ type. The graphs G in this case are either products or Cartesian products of complete graphs. We first give some generic constructions for transitive decompositions of products and Cartesian products of copies of an arbitrary graph, and we then prove (except in a small number of cases) that all transitive decompositions with respect to a rank 3 group of grid type can be characterized using these constructions. Furthermore, the main results of this work provide a new proof and insight into the classification of rank 3 partial linear spaces of product action type studied by Devillers.
منابع مشابه
Product constructions for transitive decompositions of graphs
A decomposition of a graph is a partition of the edge set, giving a set of subgraphs. A transitive decomposition is a decomposition which is highly symmetrical, in the sense that the subgraphs are preserved and transitively permuted by a group of automorphisms of the graph. This paper describes some ‘product’ constructions for transitive decompositions of graphs, and shows how these may be used...
متن کاملExamples of rank 3 product action transitive decompositions
A transitive decomposition is a pair (Γ,P) where Γ is a graph and P is a partition of the arc set of Γ such that there is a subgroup of automorphisms of Γ which leaves P invariant and transitively permutes the parts in P. In an earlier paper we gave a characterisation of G-transitive decompositions where Γ is the graph product Km×Km and G is a rank 3 group of product action type. This character...
متن کاملTransitive decompositions of graphs
A decomposition of a graph is a partition of the edge set. One can also look at partitions of the arc set but in this talk we restrict our attention to edges. If each part of the decomposition is a spanning subgraph then we call the decomposition a factorisation and the parts are called factors. Decompositions are especially interesting when the subgraphs induced by each part are pairwise isomo...
متن کاملProduct of normal edge-transitive Cayley graphs
For two normal edge-transitive Cayley graphs on groups H and K which have no common direct factor and $gcd(|H/H^prime|,|Z(K)|)=1=gcd(|K/K^prime|,|Z(H)|)$, we consider four standard products of them and it is proved that only tensor product of factors can be normal edge-transitive.
متن کامل3-arc Transitive Graphs and Abstract 4-polytopes
Abstract: When restricted to the rank 1 and rank 2 faces, the Hasse diagram of a regular abstract 4-polytope provides a bipartite graph with a high degree of symmetry. Focusing on the case of the self-dual polytopes of type 3,q,3, I will show that the graphs obtained are 3-arc transitive cubic graphs. Also, given any 3-arc transitive cubic graph, I will discuss when it is possible to consider t...
متن کامل